Graphs with Few 3-Cliques and 3-Anticliques are 3-Universal
نویسندگان
چکیده
منابع مشابه
Graphs with Few 3-Cliques and 3-Anticliques are 3-Universal
For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l -vertex graph. Here we prove this claim for k = l = 3 with a sharp bound. A similar phenomenon is established as well for tournaments with k = l = 4. C © 2014 Wiley Periodicals, Inc. J. Graph Theory 78: 229–238,
متن کاملA ug 1 99 3 Universal graphs without large cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملGraphs with full rank 3-color matrix and few 3-colorings
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomial in the number of vertices.
متن کاملComplexity Results on Graphs with Few Cliques
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection representation that satisfies the Helly property. On any such class of graphs some problems that are NP-complete on general graphs, such as the maximum...
متن کاملUniversal 3-Dimensional Visibility Representations for Graphs
This paper studies 3-dimensional visibility representations of graphs in which objects in 3-d correspond to vertices and vertical visibilities between these objects correspond to edges. We ask which classes of simple objects are universal, i.e. powerful enough to represent all graphs. In particular, we show that there is no constant k for which the class of all polygons having k or fewer sides ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2014
ISSN: 0364-9024
DOI: 10.1002/jgt.21801